Approximate K-Nearest Neighbour Based Spatial Clustering Using K-D Tree
نویسندگان
چکیده
منابع مشابه
Approximate k-nearest neighbour based spatial clustering using k-d tree
Different spatial objects that vary in their characteristics, such as molecular biology and geography, are presented in spatial areas. Methods to organize, manage, and maintain those objects in a structured manner are required. Data mining raised different techniques to overcome these requirements. There are many major tasks of data mining, but the mostly used task is clustering. Data set withi...
متن کاملTreeCANN - k-d Tree Coherence Approximate Nearest Neighbor Algorithm
TreeCANN is a fast algorithm for approximately matching all patches between two images. It does so by following the established convention of finding an initial set of matching patch candidates between the two images and then propagating good matches to neighboring patches in the image plane. TreeCANN accelerates each of these components substantially leading to an algorithm that is ×3 to ×5 fa...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملEstimating Individual Tree Growth with the k-Nearest Neighbour and k-Most Similar Neighbour Methods
The purpose of this study was to examine the use of non-parametric methods in estimating tree level growth models. In non-parametric methods the growth of a tree is predicted as a weighted average of the values of neighbouring observations. The selection of the nearest neighbours is based on the differences between tree and stand level characteristics of the target tree and the neighbours. The ...
متن کاملLocalization using a Region-Based k-Nearest Neighbour Search
This paper explores a method of performing localization on local vision mobile robots. It describes a method of processing images, extracting regions, and comparing those regions against a database of preprocessed images. Localization is achieved using the k-nearest neighbour algorithm as the basis for approximating the current position. Initial results are provided that show the potential of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Management Systems
سال: 2013
ISSN: 0975-5985,0975-5705
DOI: 10.5121/ijdms.2013.5108